Multiple Combinatorial Stokes’ Theorem with Balanced Structure
نویسندگان
چکیده
Combinatorics of complexes plays an important role in topology, nonlinear analysis, game theory, and mathematical economics. In 1967, Ky Fan used door-to-door principle to prove a combinatorial Stokes’ theorem on pseudomanifolds. In 1993, Shih and Lee developed the geometric context of general position maps, π-balanced and π-subbalanced sets and used them to prove a combinatorial formula for multiple set-valued labellings on simplexes. On the other hand, in 1998, Lee and Shih proved a multiple combinatorial Stokes’ theorem, generalizing the Ky Fan combinatorial formula to multiple labellings. That raises a question : Does there exist a unified theorem underlying Ky Fan’s theorem and Shih and Lee’s results? In this paper, we prove a multiple combinatorial Stokes’ theorem with balanced structure. Our method of proof is based on an incidence function. As a consequence, we obtain a multiple combinatorial Sperner’s lemma with balanced structure.
منابع مشابه
Combinatorial Stokes formulas via minimal resolutions
We describe an explicit chain map from the standard resolution to the minimal resolution for the finite cyclic group Zk of order k. We then demonstrate how such a chain map induces a “Zk-combinatorial Stokes theorem”, which in turn implies “Dold’s theorem” that there is no equivariant map from an n-connected to an n-dimensional free Zk-complex. Thus we build a combinatorial access road to probl...
متن کاملSimplicial Moves on Balanced Complexes
We introduce a notion of cross-flips: local moves that transform a balanced (i.e., properly (d + 1)-colored) triangulation of a combinatorial d-manifold into another balanced triangulation. These moves form a natural analog of bistellar flips (also known as Pachner moves). Specifically, we establish the following theorem: any two balanced triangulations of a closed combinatorial d-manifold can ...
متن کاملعدد تناوبی گرافها
In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem.
متن کاملLinear Series on Semistable Curves
We study h 0 (X, L) for line bundles L on a semistable curve X of genus g, parametrized by the compactified Picard scheme. The theorem of Riemann is shown to hold. The theorem of Clifford is shown to hold in the following cases: X has two components; X is any semistable curve and d = 0 or d = 2g − 2; X is stable, free from separating nodes, and d ≤ 4. These results are shown to be sharp. Applic...
متن کامل